Efficient Solutions to Two-Party and Multiparty Millionaires’ Problem
نویسندگان
چکیده
منابع مشابه
A fair and efficient solution to the socialist millionaires' problem
We present a solution to the Tiercé problem, in which two players want to know whether they have backed the same combination (but neither player wants to disclose its combination to the other one). The problem is also known as the socialist millionaires’ problem, in which two millionaires want to know whether they happen to be equally rich. In our solution, both players will be convinced of the...
متن کاملAn Efficient Protocol for Yao?s Millionaires? Problem
The increase in volume and sensitivity of data communicated and processed over the Internet has been accompanied by a corresponding need for e-commerce techniques in which entities can participate in a secure and anonymous fashion. Even simple arithmetic operations over a set of integers partitioned over a network require sophisticated algorithms. As a part of our earlier work, we have develope...
متن کاملMillions of Millionaires: Multiparty Computation in Large Networks
We describe a general Multi-Party Computation (MPC) protocol for arithmetic circuitsthat is secure against a static malicious adversary corrupting up to a 1/7 fraction of theparties. The protocol requires each party to send an average of O(mn log 3 n)bits, and computeO(mn log 4 n)operations in a network of size n, where m is the size of ci...
متن کاملEfficient Secure Two - Party Protocols ”
This book provides a rigorous introduction to a smaller example of general secure multiparty computation (SMC), namely the case of two-party protocols. The approach is structured somewhat top-down: the authors first explain notions of security and security definitions for their chosen scenario, namely that of two-party protocols, with a static adversary, in the stand-alone model; then they look...
متن کاملEfficient Covert Two-Party Computation
Covert computation (of general functions) strengthens the notion of secure computation so that the computation hides not only everything about the participants’ inputs, except for what is revealed by the function output, but it also hides the very fact that the computation is taking place, by ensuring that protocol participants are indistinguishable from random beacons, except when the function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2017
ISSN: 1939-0114,1939-0122
DOI: 10.1155/2017/5207386